Algorithms for Computational Viral Extension - Direct and Inverse Problems
نویسندگان
چکیده
The computational viral extension direct and inverse problems are problems of long-standing interest in mathematics, epidemic and natural disaster studies. We designed and developed a set of algorithms for the construction of the closure of the arbitrary chaotic set that can efficiently be used in evaluations of the propagations autooscillatory waves. The algorithms presented in this paper are readily applicable to applications in the management of epidemics, disaster handling, political propaganda issues, and the study of marketing (and others). The first author of this paper has successfully applied these algorithms to Chornobyl Zone, forest fire in Siberia, cholera epidemic in Odessa (Ukraine) and Astrakhan (Russia), and anthrax in Altai (Russia).
منابع مشابه
Inverse and Reverse 2-facility Location Problems with Equality Measures on a Network
In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...
متن کاملA novel computational procedure based on league championship algorithm for solving an inverse heat conduction problem
Inverse heat conduction problems, which are one of the most important groups of problems, are often ill-posed and complicated problems, and their optimization process has lots of local extrema. This paper provides a novel computational procedure based on finite differences method and league championship algorithm to solve a one-dimensional inverse heat conduction problem. At the beginning, we u...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملSolving random inverse heat conduction problems using PSO and genetic algorithms
The main purpose of this paper is to solve an inverse random differential equation problem using evolutionary algorithms. Particle Swarm Algorithm and Genetic Algorithm are two algorithms that are used in this paper. In this paper, we solve the inverse problem by solving the inverse random differential equation using Crank-Nicholson's method. Then, using the particle swarm optimization algorith...
متن کاملImproving computational efficiency in large linear inverse problems: an example from carbon dioxide flux estimation
Addressing a variety of questions within Earth science disciplines entails the inference of the spatiotemporal distribution of parameters of interest based on observations of related quantities. Such estimation problems often represent inverse problems that are formulated as linear optimization problems. Computational limitations arise when the number of observations and/or the size of the disc...
متن کامل